منابع مشابه
Unknowable Manipulators: Social Network Curator Algorithms
For a social networking service to acquire and retain users, it must find ways to keep them engaged. By accurately gauging their preferences, it is able to serve them with the subset of available content that maximises revenue for the site. Without the constraints of an appropriate regulatory framework, we argue that a sufficiently sophisticated curator algorithm tasked with performing this pro...
متن کاملX-Codes: Theory and Applications of Unknowable Inputs
This paper studies the properties of a new class of codes introduced recently (and currently being used) in the context of digital system test compaction [12]. These codes, named X-codes after the “X” symbol used to denote unknown logic values in digital systems, address the problem of detecting errors in the presence of unknowns. Specifically, an X-code produces a hash (or signature) over a se...
متن کاملStochastic Stability Under Fair Bandwidth Allocation: General File Size Distribution
We prove the stochastic stability of resource allocation under Network Utility Maximization (NUM) under general arrival process and file size distribution with bounded support, for α-fair utilities with α sufficiently small and possibly different for different sources’ utility functions. In addition, our results imply that the system operating under α-fair utility is 1/(1 + α)-approximate stabl...
متن کاملScheduling File Transfers under Port and Channel Constraints
The file transfer scheduling problem was introduced and studied by Coffman, Garey, Johnson and LaPaugh. The problem is to schedule transfers of a large collection of files between various nodes of a network under port constraint so as to minimize overall finishing time. This paper extends their model to include communication channel constraint in addition to port constraint. We formulate the pr...
متن کاملStochastic Stability Under Network Utility Maximization: General File Size Distribution
We prove the stochastic stability of resource allocation under Network Utility Maximization (NUM) undergeneral arrival process and file size distribution with bounded support, for α-fair utilities with α sufficiently smalland possibly different for different sources’ utility functions. In addition, our results imply that the system operatingunder α-fair utility is 1/(1 + α)-appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queue
سال: 2005
ISSN: 1542-7730,1542-7749
DOI: 10.1145/1059791.1059814